Hierarchical buffered routing tree generation
نویسندگان
چکیده
منابع مشابه
Hierarchical buffered routing tree generation
neighborhood search strategy, our polynomial time algorithm finds the optimum solution in an exponential-size solution sub-space. The final output is a buffered rectilinear Steiner routing tree that connects the driver of a net to its sink nodes. The two variants of the problem, i.e., maximizing the required time at the driver subject to a maximum total area constraint and minimizing the total ...
متن کاملDocument Generation with Hierarchical Latent Tree Models
In most probabilistic topic models, a document is viewed as a collection of tokens and each token is a variable whose values are all the words in a vocabulary. One exception is hierarchical latent tree models (HLTMs), where a document is viewed as a binary vector over the vocabulary and each word is regarded as a binary variable. The use of word variables allows the detection and representation...
متن کاملOlsr Scaling with Hierarchical Routing and Dynamic Tree Clustering
The Internet uses hierarchical networking, for scalability and manageability reasons. However the main ad hoc routing solutions (OLSR [1], AODV [6], DSR [8], TBRPF [7]) only provide flat networking, and generally suffer important scalability issues. This paper therefore introduces a simple mechanism providing dynamic clustering with OLSR, one of the MANET routing solutions, chosen for its easy ...
متن کاملMulticommodity Flow Algorithms for Buffered Global Routing
In this paper we describe a new algorithm for buffered global routing according to a prescribed buffer site map. Specifically, we describe a provably good multi-commodity flow based algorithm that finds a global routing minimizing buffer and wire congestion subject to given constraints on routing area (wirelength and number of buffers) and sink delays. Our algorithm allows computing the tradeof...
متن کاملBufferless and Minimally-Buffered Deflection Routing
A conventional Network-on-Chip (NoC) router uses input buffers to store in-flight packets. These buffers improve performance, but consume significant power. It is possible to bypass these buffers when they are empty, reducing dynamic power, but static buffer power remains, and when buffers are utilized, dynamic buffer power remains as well. To improve energy efficiency, bufferless deflection ro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 2002
ISSN: 0278-0070
DOI: 10.1109/43.998627